Randomized Adaptive Test Cover

نویسنده

  • Peter Damaschke
چکیده

In a general combinatorial search problem with binary tests we are given a set of elements and a hypergraph of possible tests, and the goal is to find an unknown target element using a minimum number of tests. We explore the expected test number of randomized strategies. We obtain several general results on the ratio of the expected and worst-case deterministic test number, as well as complexity results for hypergraphs of small rank, and we state some open problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deterministic versus randomized adaptive test cover

In a combinatorial search problem with binary tests, we are given a set of elements (vertices) and a hypergraph of possible tests (hyperedges), and the goal is to find an unknown target element using a minimum number of tests. We explore the expected test number of randomized strategies. Our main results are that the ratio of the randomized and deterministic test numbers can be logarithmic in t...

متن کامل

Market Adaptive Control Function Optimization in Continuous Cover Forest Management

Economically optimal management of a continuous cover forest is considered here. Initially, there is a large number of trees of different sizes and the forest may contain several species. We want to optimize the harvest decisions over time, using continuous cover forestry, which is denoted by CCF. We maximize our objective function, the expected present value, with consideration of stochastic p...

متن کامل

An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem in Graph Theory

The connected vertex cover (CVC) problem is a variant of the vertex cover problem, 1 which has many important applications, such as wireless network design, routing and wavelength 2 assignment problem, etc. A good algorithm for the problem can help us improve engineering 3 efficiency, cost savings and resources in industrial applications. In this work, we present an efficient 4 algorithm GRASP-...

متن کامل

Effects of Enclosure, Rest-delayed and Continuous Grazing Treatments on Production Rate and Vegetation Cover of SadrAbad Nodoushan of Yazd Pastures A.

In this investigation, the effects of enclosure, restal delayed grazing andcontinued grazing treatments on the production rate and vegetation cover were studied.Study area was SadrAbad pasture. After selecting three bands (1+1+1=3 hectare area) asthree treatments in the restricted and non restricted area, they were transected to threetransects. Then plots (1×2m2 ) were selected to measure the p...

متن کامل

Input-based adaptive randomized test case prioritization: A local beam search approach

Test case prioritization assigns the execution priorities of the test cases in a given test suite. Many existing test case prioritization techniques assume the fullfledged availability of code coverage data, fault history, or test specification, which are seldom well-maintained in realworld software development projects. This paper proposes a novel family of input-based local-beam-search adapti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015